Partition problem

Results: 66



#Item
31Network protocols / IBM / ACF/NCP / Virtual Telecommunications Access Method / Linux on System z / Z/OS / Logical partition / Z/VM / Internet protocol suite / System software / Software / Computing

Mainframe TCP/IP Problem Resolution,

Add to Reading List

Source URL: www.guruge.com

Language: English - Date: 2014-08-15 12:56:32
32NP-complete problems / Network theory / Graph coloring / Graph partition / Shortest path problem / Connectivity / Minimum spanning tree / Breadth-first search / Theoretical computer science / Graph theory / Mathematics

tunning_parameter_running_time_machine_number.eps

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2014-11-12 16:57:53
33Network theory / NP-complete problems / Graph partition / Shortest path problem / Centrality / Graph / Apache Hama / Connectivity / Graph theory / Mathematics / Theoretical computer science

Microsoft Word - ipdps_graph-camera

Add to Reading List

Source URL: ceng.usc.edu

Language: English - Date: 2013-01-28 15:54:56
34NP-complete problems / Scotch / Shortest path problem / Graph partition / Algorithm / Nested dissection / Graph / Mathematics / Theoretical computer science / Graph theory

Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest IPB & LaBRI, UMR CNRS 5800

Add to Reading List

Source URL: gforge.inria.fr

Language: English
35NP-complete problems / Combinatorics / Mathematical optimization / Partition problem / Heuristics / Graph theory / Heuristic function / Bin packing problem / Travelling salesman problem / Mathematics / Theoretical computer science / Computational complexity theory

Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 02:04:54
36NP-complete problems / Mathematical optimization / Operations research / Dynamic programming / Partition problem / Search algorithms / Subset sum problem / Greedy algorithm / Genetic algorithm / Theoretical computer science / Mathematics / Applied mathematics

F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning

Add to Reading List

Source URL: ijcai.org

Language: English - Date: 2008-09-30 05:19:33
37Analysis of algorithms / Algorithm / Mathematical logic / Partition problem / Time complexity / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

CS 330 – Spring 2013, Assignment 5 Assignments due at the beginning of class (11AM), Thursday, April 5 Question[removed]pts). Chapter 6, Exercise 8, on p[removed]Question[removed]pts). Chapter 6, Exercise 10, on p[removed]Ques

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2013-03-21 14:14:43
38NP-complete problems / Cubes / Hypercube / Parallel computing / Shortest path problem / Heuristic / Graph partition / Algorithm / Mathematics / Theoretical computer science / Computational complexity theory

An E cient Mean Field Annealing Formulation for Mapping Unstructured? Domains to Hypercubes Cevdet Aykanat and I_smail Haritaoglu Computer Engineering Department, Bilkent University, Ankara, Turkey [removed]

Add to Reading List

Source URL: www.cs.bilkent.edu.tr

Language: English - Date: 2006-07-06 10:53:25
39NP-complete problems / Operations research / Simulated annealing / Combinatorial optimization / Travelling salesman problem / Graph partition / Local search / Algorithm / Kernighan–Lin algorithm / Theoretical computer science / Mathematics / Applied mathematics

ARTICLES OPTIMIZATION BY SIMULATED ANNEALING: AN EXPERIMENTAL EVALUATION; PART I, GRAPH PARTITIONING DAVID S. JOHNSON AT&T Bell Laboratories, Murray Hill, New Jersey

Add to Reading List

Source URL: www-vis.lbl.gov

Language: English - Date: 2009-06-12 15:46:04
40Network flow / Combinatorial optimization / Flow network / Maximum flow problem / Minimum cut / Cut / Max-flow min-cut theorem / Connectivity / Graph partition / Mathematics / Graph theory / Theoretical computer science

Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology, Cambridge, Massachusetts AND

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-11-19 02:38:52
UPDATE